Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets

Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (CDS) based routing is a promising approach for enhancing the routing efficiency in sensor networks. Our idea is to generate a quality based CDS algorithm, which can resolve the standing issues like cardinality, risk factor, node failures, redundant links and network dynamics. We report a systematic approach, which has three phases. Initial phase considers the issues of revoking a partial CDS tree from a complete CDS tree. Secondary and final phases make the design of the complete algorithm by considering the elimination of dominant-act nodes using an iteration process. Our findings reveal better performance than the existing algorithms in terms of hop count, CDS size and density.